Graphs, Ags and Partitions
نویسنده
چکیده
This paper deenes, for each graph G, a ag vector fG. The ag vectors of the graphs on n vertices span a space whose dimension is p(n), the number of partitions on n. The analogy with convex polytopes indicates that the linear inequalities satissed by fG may be both interesting and accessible. Such would provide inequalities both sharp and subtle on the combinatorial structure of G. These may be related to Ramsey theory.
منابع مشابه
k-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملClustering of Attributed Graphs and Unsupervised Synthesis of Function-Described Graphs
Function-Described Graphs (FDGs) have been introduced by the authors as a representation of an ensemble of Attributed Graphs (AGs) for structural pattern recognition alternative to first-order random graphs. Both optimal and approximate algorithms for error-tolerant graph matching, which use a distance measure between AGs and FDGs, have been reported elsewhere. Also, the supervised synthesis of...
متن کاملDistance between Attributed Graphs and Function-Described Graphs Relaxing 2nd Order Restrictions
Function-Described Graphs (FDGs) have been introduced as a representation of an ensemble of Attributed Graphs (AGs) for structural pattern recognition and a distance measure using restrictions between AGs and FDGs has been reported. Nevertheless, in real applications, AGs can be distorted by some external noise, and therefore some constraints have to be relaxed. To gain more flexibility and rob...
متن کاملSome problems on idomatic partitions and b-colorings of direct products of complete graphs∗
In this note, we deal with the characterization of the idomatic partitions and b-colorings of direct products of complete graphs. We recall some known results on idomatic partitions of direct products of complete graphs and we present new results concerning the b-colorings of the direct product of two complete graphs. Finally, some open problems are given.
متن کاملFinding Domatic Partitions in Infinite Graphs
We investigate the apparent difficulty of finding domatic partitions in graphs using tools from computability theory. We consider nicely presented (i.e., computable) infinite graphs and show that even if the domatic number is known, there might not be any algorithm for producing a domatic partition of optimal size. However, we prove that smaller domatic partitions can be constructed if we restr...
متن کامل